Quick construction of recurrence relations for the Jacobi coefficients
نویسندگان
چکیده
منابع مشابه
Linear Recurrence Relations for Binomial Coefficients modulo a Prime
We investigate when the sequence of binomial coefficients ( k i ) modulo a prime p, for a fixed positive integer k, satisfies a linear recurrence relation of (positive) degree h in the finite range 0 ≤ i ≤ k. In particular, we prove that this cannot occur if 2h ≤ k < p − h. This hypothesis can be weakened to 2h ≤ k < p if we assume, in addition, that the characteristic polynomial of the relatio...
متن کاملAsymptotics for the simplest generalized Jacobi polynomials recurrence coefficients from Freud’s equations: numerical explorations
Generalized Jacobi polynomials are orthogonal polynomials related to a weight function which is smooth and positive on the whole interval of orthogonality up to a finite number of points, where algebraic singularities occur. The influence of these singular points on the asymptotic behaviour of the recurrence coefficients is investigated. AMS(MOS) subject classification. 42C05.
متن کاملStrong asymptotics of the recurrence coefficients of orthogonal polynomials associated to the generalized Jacobi weight
We study asymptotics of the recurrence coefficients of orthogonal polynomials associated to the generalized Jacobi weight, which is a weight function with a finite number of algebraic singularities on [−1, 1]. The recurrence coefficients can be written in terms of the solution of the corresponding Riemann-Hilbert problem for orthogonal polynomials. Using the steepest descent method of Deift and...
متن کاملLinearization Coefficients for the Jacobi Polynomials
i P (α,β) ni (x) et en déduire une évaluation dans le cas particulier où n1 = n2 + · · ·+ nm. ABSTRACT. — The explicit non-negative representation of the linearization coefficients of the Jacobi polynomials obtained by RAHMAN seems to be difficult to be derived by combinatorial methods. However several combinatorial interpretations can be provided for the integral of the product of Jacobi polyn...
متن کاملRecursive three term recurrence relations for the Jacobi polynomials on a triangle
Given a suitable weight on IR, there exist many (recursive) three term recurrence relations for the corresponding multivariate orthogonal polynomials. In principle, these can be obtained by calculating pseudoinverses of a sequence of matrices. Here we give an explicit recursive three term recurrence for the multivariate Jacobi polynomials on a simplex. This formula was obtained by seeking the b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1992
ISSN: 0377-0427
DOI: 10.1016/0377-0427(92)90021-o